Most Reported Genetic Associations With General Intelligence Are Probably False Positives
نویسندگان
چکیده
منابع مشابه
Most reported genetic associations with general intelligence are probably false positives.
General intelligence (g) and virtually all other behavioral traits are heritable. Associations between g and specific single-nucleotide polymorphisms (SNPs) in several candidate genes involved in brain function have been reported. We sought to replicate published associations between g and 12 specific genetic variants (in the genes DTNBP1, CTSD, DRD2, ANKK1, CHRM2, SSADH, COMT, BDNF, CHRNA4, DI...
متن کاملA closer look at self-reported suicide attempts: false positives and false negatives.
The validity of self-reported suicide attempt information is undermined by false positives (e.g., incidences without intent to die), or by unreported suicide attempts, referred to as false negatives. In a sample of 1,385 Austrian adults, we explored the occurrence of false positives and false negatives with detailed, probing questions. Removing false positives decreased the rate of suicide atte...
متن کاملDealing with False Positives in Intrusion Detection
Many of today's Intrusion Detection Systems (IDSs) suffer from high rates of false positives [1]. False positives are a severe problem because investigating them takes time and energy. Even worse, if the load of false positives is too high, security personnel might become negligent and start to ignore alarms. Improving this situation is difficult [1, 2]. One possible solution is to use highly s...
متن کاملSpecification Mining with Few False Positives
Formal specifications can help with program testing, optimization, refactoring, documentation, and, most importantly, debugging and repair. Unfortunately, formal specifications are difficult to write manually and techniques that infer specifications automatically suffer from 90–99% false positive rates. Consequently, neither option is currently practiced for most software development projects. ...
متن کاملMost Probably Intersecting Hypergraphs
The celebrated Erdős-Ko-Rado theorem shows that for n > 2k the largest intersecting k-uniform set family on [n] has size ( n−1 k−1 ) . It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting. We consider the most prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychological Science
سال: 2012
ISSN: 0956-7976,1467-9280
DOI: 10.1177/0956797611435528